Analyzing the Query Performance over a Distributed Network of Data Aggregators
نویسندگان
چکیده
Typically a user desires to obtain the value of some aggregation function over distributed data items. We present a low-cost, scalable technique to answer continuous aggregation queries using a network of aggregators of dynamic data items. In such a network of data aggregators, each data aggregator serves a set of data items at specific coherencies. Our technique involves decomposing a client query into sub-queries and executing sub-queries on judiciously chosen data aggregators with their individual sub-query incoherency bounds. We provide a technique for getting the optimal set of sub-queries with their incoherency bounds, which satisfies client query’s coherency requirement with least number of refresh messages sent from aggregators to the client. For estimating the number of refresh messages, we build a query cost model which can be used to estimate the number of messages required to satisfy the client specified incoherency bound. Performance results using real-world traces show that our cost based query planning leads to queries being executed using less than one third the number of messages required by existing
منابع مشابه
Query Planning for Continuous Aggregation Queries Using Data Aggregators
Continuous aggregation queries are used to monitor the changes in data with time varying for online decision making. For continuous queries low cost and scalable techniques used a network of aggregators. Individual node cannot by itself determine its inclusion in the query result for this a different algorithmic challenges from aggregate and selection queries are presented. At specific coherenc...
متن کاملContinuous Query Processing Of Dynamic Data Items In Network Aggregation Environment
The internet is continuously getting loaded with the data. The internet has grown in popularity from being a mere facility to a necessity. It is becoming a universal medium for information publication and usage. The continuous queries are used to monitor the changes to the time varying data and to provide results for online decision making. The client wants to obtain the value of aggregation fu...
متن کاملTracking performance of incremental LMS algorithm over adaptive distributed sensor networks
in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...
متن کاملA Stochastic Operational Planning Model for Smart Power Systems
Smart Grids are result of utilizing novel technologies such as distributed energy resources, and communication technologies in power system to compensate some of its defects. Various power resources provide some benefits for operation domain however, power system operator should use a powerful methodology to manage them. Renewable resources and load add uncertainty to the problem. So, independe...
متن کاملOptimized Intention for Continuous Queries in the Active Data Aggregation Network with Cost Model
Within an RDBMS streams of changes to the data and reporting when the result of a query defined over the data changes. These queries are referred to as the continuous queries since they continually produce results whenever new data arrives or existing data changes. To make online decision we require monitoring the continuous queries. Here the aim is to introduce the low-cost, scalable technique...
متن کامل